Efficient Algorithms for Parallel Excitation and Parallel Imaging with Large Arrays
نویسندگان
چکیده
During the past two decades, techniques and devices were developed to transmit and receive signals with a phased array instead of a single coil in the MRI (Magnetic Resonance Imaging) system. The two techniques to simultaneously transmit and receive RF signals using phased arrays are called parallel excitation (pTx) and parallel imaging (PI), respectively. These two techniques lead to shorter transmit pulses for higher imaging quality and faster data acquisition correspondingly. This dissertation focuses on improving the efficiency of the pTx pulse design and the PI reconstruction in MRI. Both PI and pTx benefit from the increased number of elements of the array. However, efficiency concerns may arise which include: (1) In PI, the computation cost of the reconstructions and the achievable acceleration factors and (2) in pTx, the pulse design speed and memory cost. The work presented in this dissertation addresses these issues. First, a correlation based channel reduction algorithm is developed to reduce the computation cost of PI reconstruction. In conventional k-domain methods, the individual channel data is reconstructed via linear interpolation of the neighbourhood data from all channels. In this proposed algorithm, we choose only a subset of the channels based on the spatial correlation. The results have shown that the computation cost can be significantly reduced with similar or higher reconstruction accuracy. Then, a new parallel imaging method named parallel imaging using localized receive arrays with Sinc interpolation(PILARS) is proposed to improve the actual acceleration factor and to reduce the computation cost. It employs the local support of individual coils and pre-determines the magnitude of the reconstruction coeffi-
منابع مشابه
On the Optimum Directivity of Uniformly Spaced Broadside Arrays of Parallel Half-Wave Dipoles (RESEARCH NOTES)
The nominal directivity for uniformly spaced broadside parallel half-wave dipoles associated with a uniform excitation is evaluated. The amplitude distribution for an optimized directivity is then obtained for different numbers of elements with the separations between the dipoles as a variable. The optimum and nominal directivities are compared for different spacings of the elements. While thes...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013